Counting Descents, Rises, and Levels, with Prescribed First Element, in Words
نویسندگان
چکیده
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic “descent” by fixing parity of one of the descent’s numbers. Results in [8] were extended and generalized in several ways in [7, 9, 10, 11]. In this paper, we shall fix a set partition of the natural numbers N, (N1, . . . ,Nt), and we study the distribution of descents, levels, and rises according to whether the first letter of the descent, rise, or level lies in Ni over the set of words over the alphabet [k]. In particular, we refine and generalize some of the results in [4].
منابع مشابه
Counting ordered patterns in words generated by morphisms I. Rises, descents, and repetitions with gaps
We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. The case of rises and descents is considered. We give recurrence formulas in the general case. We deduce exact formulas for a particular family of morphisms.
متن کاملRecounting the Number of Rises, Levels, and Descents in Finite Set Partitions
A finite set partition is said to have a descent at i if it has a descent at i in its canonical representation as a restricted growth function (and likewise for level and rise). In this note, we provide direct combinatorial proofs as well as extensions of recent formulas for the total number of rises, levels, and descents in all the partitions of an n-set with a prescribed number of blocks. In ...
متن کاملCounting Ordered Patterns in Words Generated by Morphisms
We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. We consider certain patterns with gaps (classical patterns) and those with no gaps (consecutive patterns). Occurrences of the patterns are known, in the literature, as rises, descents, (non-)inversions, squares and p-repetitions. We give recurrence formulas in the general case, th...
متن کاملCounting Pairs of Words According to the Number of Common Rises, Levels, and Descents
A level (L) is an occurrence of two consecutive equal entries in a word w = w1w2 · · · , while a rise (R) or descent (D) occurs when the right or left entry, respectively, is strictly larger. If u = u1u2 · · ·un and v = v1v2 · · ·vn are k-ary words of the same given length and 1∑ i ∑ n°1, then there is, for example, an occurrence of LR at index i if ui = ui+1 and vi < vi+1, and, likewise, for t...
متن کاملSet partitions as geometric words
Using an analytic method, we derive an alternative formula for the probability that a geometrically distributed word of length n possesses the restricted growth property. Equating our result with a previously known formula yields an algebraic identity involving alternating sums of binomial coefficients via a probabilistic argument. In addition, we consider refinements of our formula obtained by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 10 شماره
صفحات -
تاریخ انتشار 2008